Matrices with Prescribed Row and Column Sums
نویسنده
چکیده
This is a survey of the recent progress and open questions on the structure of the sets of 0-1 and non-negative integer matrices with prescribed row and column sums. We discuss cardinality estimates, the structure of a random matrix from the set, discrete versions of the Brunn-Minkowski inequality and the statistical dependence between row and column sums.
منابع مشابه
Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: Combinatorial and algorithmic applications
We prove a new efficiently computable lower bound on the coefficients of stable homogeneous polynomials and present its algorithmic and combinatorial applications. Our main application is the first poly-time deterministic algorithm which approximates the partition functions associated with boolean matrices with prescribed row and column sums within simply exponential multiplicative factor. This...
متن کاملOn the Number of Matrices and a Random Matrix with Prescribed Row and Column Sums and 0-1 Entries
We consider the set Σ(R, C) of all m×n matrices having 0-1 entries and prescribed row sums R = (r1, . . . , rm) and column sums C = (c1, . . . , cn). We prove an asymptotic estimate for the cardinality |Σ(R, C)| via the solution to a convex optimization problem. We show that if Σ(R, C) is sufficiently large, then a random matrix D ∈ Σ(R, C) sampled from the uniform probability measure in Σ(R, C...
متن کاملAsymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
We prove an asymptotic estimate for the number of m×n non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate the volume of the polytope of m × n non-negative real matrices with prescribed row and column sums. Our estimates are solutions of convex optimization proble...
متن کاملAn Asymptotic Formula for the Number of Non-negative Integer Matrices with Prescribed Row and Column Sums
We count m×n non-negative integer matrices (contingency tables) with prescribed row and column sums (margins). For a wide class of smooth margins we establish a computationally efficient asymptotic formula approximating the number of matrices within a relative error which approaches 0 as m and n grow.
متن کاملOn the Existence of Sequences and Matrices With Prescribed Partial Sums of Elements
We prove necessary and sufficient conditions for the existence of sequences and matrices with elements in given intervals and with prescribed lower and upper bounds on the element sums corresponding to the sets of an orthogonal pair of partitions. We use these conditions to generalize known results on the existence of nonnegative matrices with a given zero pattern and prescribed row and column ...
متن کامل